Hitting All Maximal Independent Sets of a Bipartite Graph
نویسندگان
چکیده
منابع مشابه
MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملOn Generating All Maximal Independent Sets
Generating all configurations that satisfy a given specification (e.g., all permutations of n objects that do not fix any object) is a well-studied problem in combinatorics [6]. Graph theory suggests many interesting problems of this type (see, e.g., [7]). Among them, generating all maximal independent sets of a given graph is one that has attracted considerable attention in the past [4,5,8]. (...
متن کاملA graph polynomial for independent sets of bipartite graphs
We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings, the number of perfect matchings, and, for bipartite graphs, the number of independent sets (#BIS). We analyse the complexity of exact evaluation of the polynomial at rational points and show a dichotomy result: for most points exact evaluation is #P-hard (assuming the general...
متن کاملMaximal independent sets in bipartite graphs obtained from Boolean lattices
Attempts to enumeratemaximal antichains in Boolean lattices give rise to problems involving maximal independent sets in bipartite graphs whose vertex sets are comprised of adjacent levels of the lattice and whose edges correspond to proper containment. In this paper, we find bounds on the numbers of maximal independent sets in these graphs. © 2010 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9847-3